Logical Dialogues with Explicit Preference Profiles and Strategy Selection
نویسندگان
چکیده
منابع مشابه
A logical reasoning with preference
In a decision making context, multiple choices of actions are usually ooered to solve a particular problem. Consequently, the question of preferences among the actions will occur. The ordering of recommended actions by preference is made by taking into account the states of the universe of discourse. We develop here a logic L p for reasoning about preferences in such circumstances. The language...
متن کاملPreference Extraction and Reasoning in Negotiation Dialogues Preference Extraction and Reasoning in Negotiation Dialogues
Modelling user preferences is crucial in many real-life problems, ranging from individual and collective decision-making to strategic interactions between agents for example. But handling preferences is not easy. Since agents don’t come with their preferences transparently given in advance, we have only two means to determine what they are if we wish to exploit them in reasoning: we can infer t...
متن کاملApplying Logical Scoring Preference Method for Semantic Web Service Selection
In today's scenario web services have become a magnificent paradigm as the Web is moving towards a collection of services that interoperate through the Internet. Pooled with Semantic Web technologies, Web Services can be definitely interpreted and selected based on the consumers' requirements. In this paper an attempt has been made to apply LSP (Logic Scoring Preference) method with O...
متن کاملPreference Extraction From Negotiation Dialogues
This paper presents an NLP-based approach to extracting preferences from negotiation dialogues. We propose a new annotation scheme to study how preferences are linguistically expressed on two different corpus genres. We then automatically extract preferences in two steps: first, we extract the set of outcomes; then, we identify how these outcomes are ordered. We finally assess the reliability o...
متن کاملA Logical Framework with Explicit Conversions
The type theory λP corresponds to the logical framework LF. In this paper we present λH, a variant of λP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a λH term is proportional to the size of the term itself. We define an erasure map from λH to λP , and show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2017
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-017-9252-4